Sparse Functional Relevance Learning in Generalized Learning Vector Quantization
نویسندگان
چکیده
Relevance learning in learning vector quantization is a central paradigm for classi cation task depending feature weighting and selection. We propose a functional approach to relevance learning for highdimensional functional data. For this purpose we compose the relevance pro le by a superposition of only a few parametrized basis functions taking into account the functional character of the data. The number of these parameters is usually signi cantly smaller than the number of relevance weights in standard relevance learning, which is the number of data dimensions. Thus, instabilities in learning are avoided and an inherent regularization takes place. In addition, we discuss strategies to obtain sparse relevance models for further model optimization. keywords: functional vector quantization, relevance learning, feature weighting and selection, sparse models ∗corresponding author, email: [email protected]
منابع مشابه
Generalized functional relevance learning vector quantization
Generalized learning vector quantization (GRLVQ) is a prototype based classification algorithm with metric adaptation weighting each data dimensions according to their relevance for the classification task. We present in this paper an extension for functional data, which are usually very high dimensional. This approach supposes the data vectors have to be functional representations. Taking into...
متن کاملRegularization in relevance learning vector quantization using l1-norms
We propose in this contribution a method for l1-regularization in prototype based relevance learning vector quantization (LVQ) for sparse relevance pro les. Sparse relevance pro les in hyperspectral data analysis fade down those spectral bands which are not necessary for classi cation. In particular, we consider the sparsity in the relevance pro le enforced by LASSO optimization. The latter one...
متن کاملRegularization in Relevance Learning Vector Quantization Using l one Norms
We propose in this contribution a method for l1-regularization in prototype based relevance learning vector quantization (LVQ) for sparse relevance profiles. Sparse relevance profiles in hyperspectral data analysis fade down those spectral bands which are not necessary for classification. In particular, we consider the sparsity in the relevance profile enforced by LASSO optimization. The latter...
متن کاملRelevance LVQ versus SVM
The support vector machine (SVM) constitutes one of the most successful current learning algorithms with excellent classification accuracy in large real-life problems and strong theoretical background. However, a SVM solution is given by a not intuitive classification in terms of extreme values of the training set and the size of a SVM classifier scales with the number of training data. General...
متن کاملMetric Adaptation for Optimal Feature Classification in Learning Vector Quantization Applied to Environment Detection
The paper deals with the concept of relevance learning in learning vector quantization. Recent approaches are considered: the generalized learning vector quantization as well as the soft learning vector quantization. It is shown that relevance learning can be included in both methods obtaining similar structured learning rules for prototype learning as well as relevance factor adaptation. We sh...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2011